Minimal Decomposition of Inde nite Hypergeometric Sums
نویسنده
چکیده
We present an algorithm which, given a hypergeometric term T (n), constructs hypergeometric terms T1(n) and T2(n) such that T (n) = T1(n + 1) ? T1(n) + T2(n), and T2(n) is minimal in some sense. This solves the decomposition problem for indeenite sums of hypergeometric terms: T1(n + 1) ? T1(n) is the \summable part" and T2(n) the \non-summable part" of T (n).
منابع مشابه
Rational Functions Certify Combinatorial Identities
This paper presents a general method for proving and discovering combinatorial identities: to prove an identity one can present a certi cate that consists of a pair of functions of two integer variables. To prove the identity, take the two functions that are given, check that condition (1) below is satis ed (a simple mechanical task), and check the equally simple fact that the boundary conditio...
متن کاملRational Normal Forms and Minimal Decompositions of Hypergeometric Terms
We describe a multiplicative normal form for rational functions which exhibits the shift structure of the factors, and investigate its properties. On the basis of this form we propose an algorithm which, given a rational function R, extracts a rational part F from the product of consecutive values of R: ∏n−1 k=n0 R(k) = F (n) ∏n−1 k=n0 V (k) where the numerator and denominator of the rational f...
متن کاملStability of self-adjoint square roots and polar decompositions in inde®nite scalar product spaces
Continuity properties of factors in polar decompositions of matrices with respect to inde®nite scalar products are studied. The matrix having the polar decomposition and the inde®nite scalar product are allowed to vary. Closely related properties of a self-adjoint (with respect to an inde®nite scalar product) perturbed matrix to have a self-adjoint square root, or to have a representation of th...
متن کاملSummation in Maple
Maple s sum command is a general purpose procedure to calculate di erent types of sums Algorithms for the computation of both inde nite and de nite sums are available Roberto Pirastu gave an excellent overview about rational summation and we take his article as a starting point for ours and thus will not focus on the rational case We will instead discuss three important methods for more general...
متن کاملDefinite Sums of Hypergeometric Terms and Limits of P-Recursive Sequences
The ubiquity of the class of D-finite functions and P-recursive sequences in symbolic computation is widely recognized. This class is defined in terms of linear differential and difference equations with polynomial coefficients. In this thesis, the presented work consists of two parts related to this class. In the first part, we generalize the reduction-based creative telescoping algorithms to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001